Branch-and-Price for a Multi-attribute Technician Routing and Scheduling Problem

In this paper, we present an exact branch-and-price algorithm for a multi-attribute technician routing and scheduling problem. This problem integrates number of distinctive features from real-world application, like management inventory different parts multiple time windows service. Based on the fact that not all tasks need to be performed, new ternary branching scheme is introduced within algorithm. Computational results show our can solve instances with up 45 greatly improves upon commercial solver applied arc-based mixed integer linear program.